Cost Functions , Time Horizon , Decision - Dependent

نویسنده

  • Elmira Popova
چکیده

We define what is a replacement policy for a system that fails randomly in time and its main characteristics. There are several parameters that drive the structure of the optimal policy. We provide a detailed discussion of the time horizon, objective functions, and failure time distributions as part of any replacement policy. 1 Definitions and main characteristics Our daily lives involve the observation, use, construction, and destruction of many systems. We replace the light balls when they burn out, take our cars to the repair shop when the breaks need to be replaced or the oil is due to be changed. The situations requiring a replacement are usually connected to wear-out, ageing, deterioration, or failure of the item/system involved. In this presentation we will assume that all of these processes are random. Definition: A replacement policy π is a decision making rule that defines the time and type of replacement of an item or a system such that an objective defined by the decision maker is optimized. The main characteristics of any replacement policy are: • Objective function A common criteria in deciding when to perform a replacement is economically justified, i.e. a cost function (called objective function), G(x), is optimized with respect to a set of parameters. Examples are the smallest average replacement cost per unit time or the total discounted cost. Alternative objectives are the maximum reliability, minimum net present cost, internal rate of return, or any general utility function defined by the decision maker. • Time of replacement A replacement can be performed: as soon as the item fails (also known as corrective maintenance), before failure (preventive maintenance), or in a certain amount of time after failure. This will be one of the objective function’s parameters, call it T . We will try to find the value of T that optimizes the objective function. • Type of replacement The item can be replaced with a new one or with an old (used) one. This is another one of the objective function parameters, denote it by a. As before, we would like to find the age of the system with which we will replace the ”old” one that optimizes the objective function. • Failure time The failure occurrences are assumed to be random following a general counting stochastic process {N(t), t ≥ 0}, see Rausand and Høyland (2004, page 231). The ”failure time” will be the time between two consecutive failures. We can formulate the general stochastic optimization problem of finding the optimal replacement policy π = (T ∗, a∗) as min T,a∈R+ E[G(T, a, t)] (1) where E stands for the expectation operator taken with respect to a filtration up to time t defined by the counting process N(t). The decision variables are T time of replacement and a age of the replacing item. Note that if we want to find the maximum of the objective function, it will be equivalent to finding the minimum of its negative value. Here are some common replacement policies one can obtain for specific values of the time of replacement, T : • Age replacement policy: the item/system is replaced upon failure or at age Y , whichever comes first (see eqr111).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inventory Model for Non – Instantaneous Deteriorating Items, Stock Dependent Demand, Partial Backlogging, and Inflation over a Finite Time Horizon

In the present study, the Economic Order Quantity (EOQ) model of two-warehouse deals with non-instantaneous deteriorating items, the demand rate considered as stock dependent and model affected by inflation under the pattern of time value of money over a finite planning horizon. Shortages are allowed and partially backordered depending on the waiting time for the next replenishment. The main ob...

متن کامل

Calculating cost efficiency using prices dependent on time via approximate method

In the traditional cost-efficiency model, the information about each decision unit includes inputs, outputs, and the input prices are fixed and specific. In practice, the price of the inputs often fluctuates at different times, and these prices for the decision-making unit are time-dependent. By the traditional method, the efficiency of decision units is impossible in the presence of time-depen...

متن کامل

On the Convergence of Optimal Actions for Markov Decision Processes and the Optimality of (s, S) Inventory Policies

This paper studies convergence properties of optimal values and actions for discounted and averagecost Markov Decision Processes (MDPs) with weakly continuous transition probabilities and applies these properties to the stochastic periodic-review inventory control problem with backorders, positive setup costs, and convex holding/backordering costs. The following results are established for MDPs...

متن کامل

A production-inventory model with permissible delay incorporating learning effect in random planning horizon using genetic algorithm

This paper presents a production-inventory model for deteriorating items with stock-dependent demand under inflation in a random planning horizon. The supplier offers the retailer fully permissible delay in payment. It is assumed that the time horizon of the business period is random in nature and follows exponential distribution with a known mean. Here learning effect is also introduced for th...

متن کامل

EOQ Model with Time Dependent Demand Rate and Time Dependent Holding Cost Function

In this paper the authors consider the continuous deterministic, infinite horizon, single item inventory system within the setting of a retailer sector in which the demand rate for an item is time dependent. The parameter of the replenishment cost is kept constant, but the carrying cost per unit is allowed to vary. The optimal policies are found, and decision rules and classical EOQ model have ...

متن کامل

A Time Dependent Pollution Routing Problem in Multi-graph

This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost.  In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006